( 2 ) with the basis of ( 1 ) , the thesis present a improved hough transform algorithm based on grc , it turns out its improvement on algorithm complexity 、 accuracy and its useness . ( 3 ) with the deeply analysis on the problem existed in a license plate locating algorithm , which based on the extraction of parallelogram , and ( 3 )在车牌定位算法中,在实验的基础上深入分析了基于平行四边形提取的车牌定位算法中存在的问题,并探讨了如何用粒度计算解决这些问题。
The discussion of main parallel technologies on construction of parallel sliq algorithm is presented in this paper . the computing result of algorithm complexity of sequential and parallel algorithm indicates : when the data set is large enough , as to continuous attributes , the parallel algorithm almost get speedup value equal to the number of processors ， while as to categorical attribute the improvement of parallel algorithm is limited 通过对串行和并行算法时间复杂度的计算表明，当数据集充分大时，由于连续属性的排序计算操作分散到各个处理机单元上进行，显著降低了计算时间，从而可以得到近似于处理机个数的加速比，对于离散属性，本并行算法对串行算法的性能提高有限
Considering the np - complete problem , how to get the approximate optimized scheme of job - shop scheduling , and aimed at improving the efficiency of products and taking good advantage of concurrence , asynchronism , distributing and juxtaposition in multi - products and devices processing , we could divide the working procedures into the attached one which has the only precursor and subsequence and unattached one by analyzing working flow chart of job - shop , that is the working procedures are divided into two types , then the bf and the ff methods about memory scheduling in os are applied , therefore a new approximate optimized scheme is presented in the paper which could solve the common job - shop scheduling . namely , the acpm and the bfsm are applied to the classified and grouped working procedures considering the compact of the procedures and practical examples approved it . the results we analyzing and tested show that it is better than the heuristic algorithm common used , for less restriction terms , more satisfying algorithm complexity and better optimized results 针对job - shop调度问题求最优解算法这一npc问题，本文以充分发挥多产品、多设备加工所具有并发性、异步性、分布性和并行性的加工优势，从而提高产品的加工效率为目标，对job - shop调度问题的工艺图进行适当分解，使工序在一定时间段或是为具有唯一紧前、紧后相关工序或是为独立工序，即将工序分两类，再结合操作系统中内存调度的最佳适应( bf )调度方法和首次适应( ff )调度方法的先进思想，通过分析提出了一种解决一般job - shop调度问题的全新近优解方案：在考虑关键设备上工序尽量紧凑的前提下，将工序分类、对这两类工序分批采用拟关键路径法( acpm )和最佳适应调度方法( bfsm )安排工序的算法，用实例加以验证，并给出结果甘特图。
Complexity parameter c2 , fluctuation complexity parameter cf and algorithm complexity parameter c ( n ) have been adopted to analysis pressure fluctuation signals from a gas - solid fluidized bed , the variation of the three complexity parameters with gas velocity from fixed bed , bubbling fluidization to turbulence fluidization are studied , then compared in order to characterize regime behaviors . it is demonstrated that there exists a phenomenon named " recorded " in the regime transition from fixed bed to bubbling fluidization , the three complex parameters are believed to be a new technique for flow regime identification 结果表明，起始流化至鼓泡态转变的过程中，复杂性参数表明气固体系会进行一种所谓的“重构”现象，这与用k熵表征起始流化态至鼓泡态之间变化时所得到的结果相一致，并能明确地指示固定床、鼓泡流化及湍动流化等不同流态之间的转变过程，为流型识别提供了新思路。
